Instances Selection Algorithms in the Conjunction with LVQ
نویسندگان
چکیده
This paper can be seen from two sides. From the first side as the answer of the question: how to initialize the Learning Vectors Quantization algorithm. And from second side it can be seen as the method of improving of instances selection algorithms. In the article we propose to use a conjunction of the LVQ and some of instances selection algorithms because it simplify the LVQ initialization and provide to better prototypes set. Moreover prepared experiments clearly show that such combinations of methods provide to higher classification accuracy on the unseen data. The results were computed and averaged for several benchmarks.
منابع مشابه
IFSB-ReliefF: A New Instance and Feature Selection Algorithm Based on ReliefF
Increasing the use of Internet and some phenomena such as sensor networks has led to an unnecessary increasing the volume of information. Though it has many benefits, it causes problems such as storage space requirements and better processors, as well as data refinement to remove unnecessary data. Data reduction methods provide ways to select useful data from a large amount of duplicate, incomp...
متن کاملWindow-Based Example Selection in Learning Vector Quantization
A variety of modifications have been employed to learning vector quantization (LVQ) algorithms using either crisp or soft windows for selection of data. Although these schemes have been shown in practice to improve performance, a theoretical study on the influence of windows has so far been limited. Here we rigorously analyze the influence of windows in a controlled environment of gaussian mixt...
متن کاملDynamics and Generalization Ability of LVQ Algorithms
Learning vector quantization (LVQ) schemes constitute intuitive, powerful classification heuristics with numerous successful applications but, so far, limited theoretical background. We study LVQ rigorously within a simplifying model situation: two competing prototypes are trained from a sequence of examples drawn from a mixture of Gaussians. Concepts from statistical physics and the theory of ...
متن کاملDynamics and generalization ability of LVQ algorithms Dynamics and generalization ability of LVQ algorithms
Learning vector quantization (LVQ) schemes constitute intuitive, powerful classification heuristics with numerous successful applications but, so far, limited theoretical background. We study LVQ rigorously within a simplifying model situation: two competing prototypes are trained from a sequence of examples drawn from a mixture of Gaussians. Concepts from statistical physics and the theory of ...
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کامل